Combinatorial Constructions of 3- and 4-Secure Codes

نویسندگان

  • Yeijing Wang
  • Jennifer Seberry
  • Beata J. Wysocki
  • Tadeusz A. Wysocki
  • Willy Susilo
  • Tianbing Xia
  • Ying Zhao
  • Chung Tran
  • Yejing Wang
  • Le Chung Tran
چکیده

In this paper, 3and 4-secure codes are constructed from combinatorial designs. Both constant weight and non-constant weight codes are shown.

منابع مشابه

Separating and Intersecting Properties of BCH and Kasami Codes

Separating codes have recently been applied in the construction of collusion secure fingerprinting schemes. They are related to other combinatorial concepts like intersecting codes, superimposed codes, hashing families, and group testing. In this paper we study some good, binary asymptotic constructions of such codes.

متن کامل

New Constructions for Perfect Hash Families andRelated Structures using Combinatorial

In this paper, we consider explicit constructions of perfect hash families using combi-natorial methods. We provide several direct constructions from combinatorial structures related to orthogonal arrays. We also simplify and generalize a recursive construction due to Atici, Magliversas, Stinson and Wei 3]. Using similar methods, we also obtain eecient constructions for separating hash families...

متن کامل

Bounds and Constructions for Multireceiver Authentication Codes

Multireceiver authentication codes allow one sender to construct an authenticated message for a group of receivers such that each receiver can verify authenticity of the received message. In this paper, we give a formal deenition of multireceiver authentication codes, derive information theoretic and combinatorial lower bounds on their performance and give new eecient constructions for such cod...

متن کامل

On the construction of q-ary equidistant codes

The problem of constructing equidistant codes over an alphabet of an arbitrary size q is considered. Some combinatorial constructions and computer-based search methods are presented. All maximal equidistant codes with distances 3 and 4 are found. DOI: 10.1134/S0032946007040023

متن کامل

Separating Codes: Constructions and Bounds

Separating codes, initially introduced to test automaton, have revived lately in the study of fingerprinting codes, which are used for copyright protection. Separating codes play their role in making the fingerprinting scheme secure agains coalitions of pirates. We provide here better bounds, constructions and generalizations for these codes.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003